Implicitly and densely discrete black-box optimization problems
نویسندگان
چکیده
منابع مشابه
Implicitly and densely discrete black-box optimization problems
This paper addresses derivative-free optimization problems where the variables lie implicitly in an unknown discrete closed set. The evaluation of the objective function follows a projection onto the discrete set, which is assumed dense (and not sparse as in integer programming). Such a mathematical setting is a rough representation of what is common in many real-life applications where, despit...
متن کاملImplicitely and Densely Discrete Black-Box Optimization Problems∗
This paper addresses derivative-free optimization problems where the variables lie implicitly in an unknown discrete closed set. The evaluation of the objective function follows a projection onto the discrete set, which is assumed dense rather than sparse. Such a mathematical setting is a rough representation of what is common in many real-life applications where, despite the continuous nature ...
متن کاملComplexity Theory for Discrete Black-Box Optimization Heuristics
A predominant topic in the theory of evolutionary algorithms and, more generally, theory of randomized black-box optimization techniques is running time analysis. Running time analysis aims at understanding the performance of a given heuristic on a given problem by bounding the number of function evaluations that are needed by the heuristic to identify a solution of a desired quality. As in gen...
متن کاملDeterministic approaches for solving practical black-box global optimization problems
In many important design problems, some decisions should be made by finding the global optimum of a multiextremal objective function subject to a set of constrains. Frequently, especially in engineering applications, the functions involved in optimization process are black-box with unknown analytical representations and hard to evaluate. Such computationally challenging decision-making problems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2009
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-009-0120-2